Augmented convex hull plots: Rationale, implementation in R and biomedical applications
نویسندگان
چکیده
The paper addresses the possibility to replace cluttered multi-group scatter-plots with augmented convex hull plots. By replacing scatter-plot points with convex hulls, space is gained for visualization of descriptive statistics with error bars or confidence ellipses within the convex hulls. An informative addition to the plot is calculation of the area of convex hull divided by corresponding group size as a bivariate dispersion measure. Marginal distributions can be depicted on the sides of the main plot in established ways. Bivariate density plots might be used instead of convex hulls in the presence of outliers. Like any scatter-plot type visualization, the technique is not limited to raw data -- points can be derived from any dimension reduction technique, or simple functions can be used as axes instead of original dimensions. The limited possibilities for producing such plots in existing software are surveyed, and our general and flexible implementation in R -- the publicly available chplot function -- is presented. Examples based on our daily biostatistical consulting practice illustrate the technique with various options.
منابع مشابه
Convex Hull Brushing in Scatter Plots - Multi-dimensional Correlation Analysis
Interactive Visual Analysis has been widely used for the reason that it allows users to investigate highly complex data in coordinated multiple views, showing different perspectives over data. In order to relate data, multiple techniques of brushing have been introduced. This work extends the state of the art by introducing the Convex Hull (CH) Brush, which is a new way of selecting and interpr...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملTechnical Report: Convex Hull Game: a Tangible Context for Algorithms and Computer Graphics Concepts
This paper presents a unique way to engage students in an Algorithms or Computer Graphics course through the development of a convex hull-based game. The game provides a compelling context to use image processing techniques to create a simple tangible user interface that allows players to physically manipulate the input to a convex hull algorithm and display an impressive visualization as the r...
متن کاملL-CONVEX SYSTEMS AND THE CATEGORICAL ISOMORPHISM TO SCOTT-HULL OPERATORS
The concepts of $L$-convex systems and Scott-hull spaces are proposed on frame-valued setting. Also, we establish the categorical isomorphism between $L$-convex systems and Scott-hull spaces. Moreover, it is proved that the category of $L$-convex structures is bireflective in the category of $L$-convex systems. Furthermore, the quotient systems of $L$-convex systems are studied.
متن کاملExact and Efficient Construction of Minkowski Sums of Convex Polyhedra with Applications
We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it produces exact results. We also present applications of the Minkowski-sum computation to answer collision and proximity queries about the relative p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer methods and programs in biomedicine
دوره 78 1 شماره
صفحات -
تاریخ انتشار 2005